hash address
英 [hæʃ əˈdres]
美 [hæʃ əˈdres]
网络 散列地址; 哈希地址; 杂凑地址
双语例句
- Create a hash keyed on e-mail address for each state name, to be checked in the main program loop.
创建与每个州名的电子邮件地址绑定的散列，将在主程序循环中检查该散列。 - The "to" element of the option hash is mapped to the address location of the service.
选项散列的“to”元素将映射到服务的地址位置。 - This property contains the ASCII-encoded SHA1 hash of a mailbox URI; this encoding is a one-way mapping and cannot be trivially reverse-engineered to give the original e-mail address.
该特性包含邮箱URI的ASCII编码的SHA1散列；该编码是单向映射并且不能很一般地进行逆向工程以给出原始的电子邮件地址。 - A similar technology exists called content-addressable storage ( CAS) that uses a hash of the data to identify its name and address.
存在名为内容寻址存储（content-addressablestorage，CAS）的类似技术，其使用数据散列值以便标识其名称和地址。 - The various hash index methods are intended to address different aspects of the hashing itself, like the handling of collisions or overflows.
不同的hash索引方法用于解决hash本身的不同方面，例如处理冲突或溢出。 - You can think of a hash table conceptually as a series of buckets, each with an address that is derived form the key value by applying the hash function.
可以在概念上将哈希表认为是一系列的bucket，每个bucket所拥有的地址是通过应用哈希函数从键值导出的。 - This is required, because the hash value is the address of the object and you need to maintain this if you move the object.
这是必需的，因为散列值是对象的地址，并且如果您移动该对象，则需要维护它。 - Returns a hash value for a mail address.
返回邮件地址的哈希值。 - Due to the irreversibility of random hash mapping, current sketch data structures have to traverse the key address space to find frequent items.
由于随机哈希函数不可逆，目前的概要数据结构不得不遍历关键字地址空间以查找和估计频繁项集。 - Application of Hash Table to Design Address Table in Switch Controller
散列表方法在交换控制芯片地址表设计中的应用 - In Hash based applications, choice of appropriate Hash function, which maps the key to Hash table address uniformly, will improve the Hash table lookup performance.
在基于哈希的应用中，选择恰当的哈希函数，将KEY均匀映射到各个哈希地址中，对于哈希查表性能的提高有着重要的意义。 - The other one supports Hash. Considering that most IP address operation is by locating while there is only low frequency of insertion and deletion, the first category is not applicable.
考虑到IP地址绝大多数操作是查找，相对而言，插入和删除操作的频度十分低，第一类实现方式不适用。 - Being a key technology in memory management, virtual hash page table is a mechanism for the virtual-to-physical address mapping in high performance microprocessor systems.
虚拟哈希页表（VHPT）是高性能微处理器系统实现虚拟地址到物理地址的转换映像，是存储管理的关键技术之一。 - In the Hash algorithms, their efficiency is higher than comparison when keywords are relative to the memory address of the information records.
散列算法考虑了关键字与信息记录存贮地址间关系，效率较高。 - A hash technique to improve IP address lookup
采用哈希算法改进IP地址查找的研究 - Chord is a structured method to retrieve information through the distributed hash table ( DHT) technology. DHT use consistent hash to put the query keywords and node identifier ( id) in the same address space.
Chord是一种结构化搜索方式，通过分布式哈希表（DHT）技术，将查询的关键字Key与节点标识（id）使用相容哈希[1]散列在同一地址空间中。 - The server gets the MAC address for the client and tries to match the address in a MAC table and discuss the method for the Hash collision.
从客户端获取MAC地址到服务器，并利用Hash方法实现MAC地址的匹配并讨论了冲突解决方案。 - In CGA protocol, using CGA generation algorithm generates the IPv6 address which can solve address spoofing problem, but there still exist some limitations in the CGA generation algorithm of the hash algorithm, signature algorithm, address support authentication methods.
根据CGA协议中CGA生成算法生成的IPv6地址可以很好的解决IPv6网络环境中的地址伪造问题，但是CGA生成算法在对哈希算法、签名算法、地址认证方式等支持上还存在一些局限性。 - Different from the bit-by-bit matching algorithms basd on Radix Trie, or the algorithms based on prefix-length binary-search, it makes the IP destination address match the Trie using binary-search method. And it uses parts of the destination IP address as index to avoid Hash functions.
不同于RadixTrie算法的逐一比特进行比较和对前缀长度进行二分搜索的路由查找，BSTrie采用二分法将IP目的地址与Trie进行匹配，并用部分IP目的地址做索引避免了使用Hash函数。 - We use the hash of the IP address to calculate the mark value, taking a labeling scheme of fixed-length, and write the label of the next-hop into the packet head.
该机制采用IP地址的hash值来计算标记值，使用固定长度标记方案，并提前将报文传输路径上下一跳的信息标记到报文中。 - There are many nodes in the Distributed hash table, all of these nodes within a large hash table, and each node is usually assigned an address space that is a node identifiers in order to distinguish.
分布式哈希表是由许多节点共同组成的一个大型散列表，每一个节点通常分配一个地址空间，通过节点标识符来区别。